- minimal-cut method
- метод минимальных сечений
The English-Russian dictionary on reliability and quality control. 2015.
minimal-cut method
Смотреть что такое "minimal-cut method" в других словарях:
Iterative method — In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. A specific implementation of an iterative method, including the termination… … Wikipedia
The Final Cut (band) — The Final Cut is an industrial music group, consisting mainly of Detroit s Tony Srock. BioThe Final Cut has been an international underground electronic music enigma since emerging from the late 80 s Detroit underground. Final Cut began when… … Wikipedia
Ellipsoid method — The ellipsoid method is an algorithm for solving convex optimization problems. It was introduced by Naum Z. Shor, Arkady Nemirovsky, and David B. Yudin in 1972, and used by Leonid Khachiyan to prove the polynomial time solvability of linear… … Wikipedia
Microtome — A microtome used in microscopy. A microtome (from the Greek mikros, meaning small , and temnein, meaning to cut ) is a sectioning instrument that allows for the cutting of extremely thin slices of material, known as sections. Microtomes are an… … Wikipedia
Cheating in poker — is any behavior outside the rules that is intended to give an unfair advantage to one or more players. Contents 1 Types of cheating 2 Minimal skill methods 3 Skilled methods 3.1 Marked cards … Wikipedia
Karger's algorithm — In computer science and graph theory, the Karger s algorithm is a Monte Carlo method to compute the minimum cut of a connected graph.AlgorithmThe idea of the algorithm is based on the concept of contraction of an edge e in a graph. Informally… … Wikipedia
Fault tree analysis — (FTA) is a failure analysis in which an undesired state of a system is analyzed using boolean logic to combine a series of lower level events. This analysis method is mainly used in the field of safety engineering to quantitatively determine the… … Wikipedia
Edmonds-Karp algorithm — In computer science and graph theory, the Edmonds Karp algorithm is an implementation of the Ford Fulkerson method for computing the maximum flow in a flow network in mathcal{O}(|V| cdot |E|^2). It is asymptotically slower than the relabel to… … Wikipedia
SAPHIRE — is a probabilistic risk and reliability assessment software tool. SAPHIRE stands for Systems Analysis Programs for Hands on Integrated Reliability Evaluations . The system was developed for the U.S. Nuclear Regulatory Commission (NRC) by the… … Wikipedia
United States — a republic in the N Western Hemisphere comprising 48 conterminous states, the District of Columbia, and Alaska in North America, and Hawaii in the N Pacific. 267,954,767; conterminous United States, 3,022,387 sq. mi. (7,827,982 sq. km); with… … Universalium
List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… … Wikipedia
